An exact algorithm for MAX-CUT in sparse graphs
نویسندگان
چکیده
We study exact algorithms for the max-cut problem. Introducing a new technique, we present an algorithmic scheme that computes a maximum cut in graphs with bounded maximum degree. Our algorithm runs in time O∗(2(1−(2/∆))n). We also describe a max-cut algorithm for general graphs. Its time complexity is O∗(2mn/(m+n)). Both algorithms use polynomial space. Acknowledgements: The work was done while the first author was visiting LAMSADE on a research position funded by CNRS and the second author was visiting LAMSADE being supported by DIMACS under the NSF grant INT03-39067 to Rutgers University.
منابع مشابه
An exact algorithm for MAX-CUT in sparse graphs (Preliminary version)1
The MAX-CUT problem consists in partitioning the vertex set of a weighted graph into two subsets. The objective is to maximize the sum of weights of those edges that have their endpoints in two different parts of the partition. MAX-CUT is a well known NP-hard problem and it remains NP-hard even if restricted to the class of graphs with bounded maximum degree ∆ (for ∆ ≥ 3). In this paper we stud...
متن کاملThe 12th International Conference on RANDOM STRUCTURES AND ALGORITHMS
Szemerédi’s regularity lemma has many applications, for example in extremal graph theory, in property testing, and in the development of approximation algorithms. By the nature of Szemerédi’s lemma, most applications have been to dense instances. In 1997 Kohayakawa and Rdl introduced a version of the regularity lemma that can be applied to a class of sparse graphs, namely so-called bounded grap...
متن کاملQuasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph “resembles” a random one. Moreover, a regular partition approximates a given graph by a bounded number of quasi-random graphs. Regarding quasi-randomness, we present a new spectral characterization of low discrepancy, which ex...
متن کاملSolving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter
Many hard graph problems, such as Hamiltonian Cycle, become FPT when parameterized by treewidth, a parameter that is bounded only on sparse graphs. When parameterized by the more general parameter cliquewidth, Hamiltonian Cycle becomes W[1]-hard, as shown by Fomin et al. [5]. Sæther and Telle address this problem in their paper [13] by introducing a new parameter, split-matching-width, which li...
متن کاملNew Exact Algorithms for the Two-Sided Bipartite Crossing Minimization Problem
The Two-sided Two-layer Crossing Minimization (TSCM) problem calls for minimizing a quadratic objective function subject to a set of ordering constraints, where all variables are binary. This NP-hard problem has important applications in graph drawing as a key step in drawing hierarchical graphs. In this paper, we propose two new exact algorithms for the TSCM problem. One is an LP-based branch-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 35 شماره
صفحات -
تاریخ انتشار 2007